Integer programming techniques for the nurse rostering problem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integer programming techniques for the nurse rostering problem

This work presents Integer Programming (IP) techniques to tackle the problem of the International Nurse Rostering Competition. Starting from a compact and monolithic formulation in which the current generation of solvers performs poorly, improved cut generation strategies and primal heuristics are proposed and evaluated. A large number of computational experiments with these techniques produced...

متن کامل

An Integer Programming-Based Nurse Rostering System

This paper considers a real-world rostering problem at the Gold Coast Hospital, Queensland. Nurse rostering is a constraint satisfaction problem (CSP) [3]. The task is to find a consistent allocation of shift values, for a group of nurses, over a fixed period of time, that satisfy a set of rostering constraints. These constraints include i) acceptable shift combinations (or schedules) for indiv...

متن کامل

Nurse Rostering and Integer Programming Revisited

Design and development of robust and reliable scheduling algorithms has been an active research area in Computer Science and Artificial Intelligence. Given that the general problem is computationally intractable, many heuristic-based techniques have been developed, while other approaches have used optimising techniques for specific and limited problem domains. In this paper, we consider a large...

متن کامل

A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems

This paper presents a hybrid multi-objective model that combines Integer Programming (IP) and Variable Neighbourhood Search (VNS) to deal with highly constrained nurse rostering problems in modern hospital environments. An IP is first used to solve the subproblem which includes the full set of hard constraints and a subset of soft constrains. A basic VNS then follows as a postprocessing procedu...

متن کامل

A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem

This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research were applied) tackled manually. The problem basically concerns the assignment of duties to a set of people with different qualifications, work regulations and preferences. Constraint programming and linear programming techniques ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Operations Research

سال: 2014

ISSN: 0254-5330,1572-9338

DOI: 10.1007/s10479-014-1594-6